Symbolic Execution Proofs for Higher Order Store Programs
نویسندگان
چکیده
منابع مشابه
Higher-order symbolic execution for contract verification and refutation
We present a new approach to automated reasoning about higher-order programs by endowing symbolic execution with a notion of higher-order, symbolic values. To validate our approach, we use it to develop and evaluate a system for verifying and refuting behavioral software contracts of components in a functional language, which we call soft contract verification. In doing so, we discover a mutual...
متن کاملCompositional Proofs with Symbolic Execution
A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. As logic we use an extended variant of Interval Temporal Logic that allows to formulate programs directly in the Simple Programming Language (SPL). The notation includes a complex interleaving operator. The interactive proof met...
متن کاملCrowfoot: A Verifier for Higher-Order Store Programs
We present Crowfoot, an automatic verification tool for imperative programs that manipulate procedures dynamically at runtime; these programs use a heap that can store not only data but also code (commands or procedures). Such heaps are often called higher-order store, and allow for instance the creation of new recursions on the fly. One can use higher-order store to model phenomena such as run...
متن کاملFirst-Order Proofs for Higher-Order Languages
We study the use of the-calculus for semantical descriptions of higher-order concurrent languages with state. As an example, we choose Concurrent Idealized ALGOL (CIA). CIA is particularly interesting as, yet being a core language, it combines imperative and parallel features with a procedural mechanism of full higher order. It can thus be used as a formal model for concurrent programs as, e.g....
متن کاملProofs, programs and executable specifications in higher order logic
This thesis presents several extensions to the generic theorem prover Isabelle, a logical framework based on higher order logic. The central contribution of this thesis is the extension of Isabelle with a calculus of primitive proof terms, in which proofs are represented using λ-terms in the spirit of the Curry-Howard isomorphism. Primitive proof terms allow for an independent verification of p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2014
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-014-9319-8